The 3-Steiner Root Problem
نویسندگان
چکیده
For a graph G and a positive integer k, the k-power of G is the graph G with V (G) as its vertex set and {(u, v)|u, v ∈ V (G), dG(u, v) ≤ k} as its edge set where dG(u, v) is the distance between u and v in graph G. The k-Steiner root problem on a graph G asks for a tree T with V (G) ⊆ V (T ) and G is the subgraph of T k induced by V (G). If such a tree T exists, we call it a k-Steiner root of G. This paper gives a linear time algorithm for the 3-Steiner root problem. Consider an unrooted tree T with leaves one-to-one labeled by the elements of a set V . The k-leaf power of T is a graph, denoted T k L , with T k L = (V, E), where E = {(u, v) | u, v ∈ V and dT (u, v) ≤ k}. We call T a k-leaf root of T k L . The k-leaf power recognition problem is to decide whether a graph has such a k-leaf root. The complexity of this problem is still open for k ≥ 5 [6]. It can be solved in polynomial time if the (k − 2)-Steiner root problem can be solved in polynomial time [6]. Our result implies that the k-leaf power recognition problem can be solved in linear time for k = 5.
منابع مشابه
Phylogenetic k-Root and Steiner k-Root
Given a graph G = (V; E) and a positive integer k, the Phylogenetic k-Root Problem asks for a (unrooted) tree T without degree-2 nodes such that its leaves are labeled by V and (u; v) 2 E if and only if dT (u; v) k. If the vertices in V are also allowed to be internal nodes in T , then we have the Steiner k-Root Problem. Moreover, if a particular subset S of V are required to be internal nodes ...
متن کاملOn the Hop Constrained Steiner Tree Problem with Multiple Root Nodes
We consider a new network design problem that generalizes the Hop and Diameter Constrained Minimum Spanning and Steiner Tree Problem as follows: given an edge-weighted undirected graph whose nodes are partitioned into a set of root nodes, a set of terminals and a set of potential Steiner nodes, find a minimum-weight subtree that spans all the roots and terminals so that the number of hops betwe...
متن کاملA New ILP Formulation for 2-Root-Connected Prize-Collecting Steiner Networks
We consider the real-world problem of extending a given infrastructure network in order to connect new customers. By representing the infrastructure by a single root node, this problem can be formulated as a 2-root-connected prize-collecting Steiner network problem in which certain customer nodes require two node-disjoint paths to the root, and other customers only a simple path. Herein, we pre...
متن کاملThe Depth-Restricted Rectilinear Steiner Arborescence Problem is NP-complete
In the rectilinear Steiner arborescence problem the task is to build a shortest rectilinear Steiner tree connecting a given root and a set of terminals which are placed in the plane such that all root-terminal-paths are shortest paths. This problem is known to be NP-hard. In this paper we consider a more restricted version of this problem. In our case we have a depth restrictions d(t) ∈ N for e...
متن کاملA Deterministic Algorithm for Online Steiner Tree Leasing
We study the Online Steiner Tree Leasing (OSTL) problem, defined in a weighted undirected graph with a distinguished root node r. There is a known set L of available lease types, where each type ` ∈ L is characterized by its duration D` and cost factor C`. As an input, an online algorithm is given a sequence of terminals and has to connect them to the root r using leased edges. An edge of lengt...
متن کامل